Multi-Order-Content-Based Adaptive Graph Attention Network for Graph Node Classification
نویسندگان
چکیده
In graph-structured data, the node content contains rich information. Therefore, how to effectively utilize is crucial improve performance of graph convolutional networks (GCNs) on various analytical tasks. However, current GCNs do not fully content, especially multi-order content. For example, attention (GATs) only focus low-order while high-order completely ignored. To address this issue, we propose a novel network with adaptability that could features Its core idea has following novelties: First, constructed mechanism evaluate weights. Second, can i.e., it combines mechanisms high- and Furthermore, adaptability, perform good trade-off between according task requirements. Lastly, applied constructing structural symmetry. This more reasonably weights nodes, thereby improving convergence network. addition, conducted experiments multiple datasets compared proposed model state-of-the-art models in dimensions. The results validate feasibility effectiveness model.
منابع مشابه
A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملSOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH
In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...
متن کاملAttention-based Graph Neural Network for Semi-supervised Learning
Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local neighborhood and a fully-connected layer. Perhaps surprisingly, we show that...
متن کاملProximity-based Graph Embeddings for Multi-label Classification
In many real applications of text mining, information retrieval and natural language processing, large-scale features are frequently used, which often make the employed machine learning algorithms intractable, leading to the well-known problem “curse of dimensionality”. Aiming at not only removing the redundant information from the original features but also improving their discriminating abili...
متن کاملSubstructure Assembling Network for Graph Classification
Graphs are natural data structures adopted to represent realworld data of complex relationships. In recent years, a surge of interest has been received to build predictive models over graphs, with prominent examples in chemistry, computational biology, and social networks. The overwhelming complexity of graph space often makes it challenging to extract interpretable and discriminative structura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15051036